An Effective Dynamic Task Scheduling Algorithm for Real-time Heterogeneous Multiprocessor Systems
نویسندگان
چکیده
Real-time systems require both functionally correct executions and the results that are produced in time. Fault-tolerance is an important requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we propose an effective Load-driven Adaptive Scheduling Algorithm (LASA) to dynamically schedule real-time tasks with fault-tolerance used in heterogeneous multiprocessor systems. In LASA, it has an adaptive mechanism to monitor the processor utilization and determine the number of backup copies been scheduled. Besides, we also design a task deferment mechanism to improve the utilization of reclaimed computing resources from redundant copies. According to our simulations, LASA makes a trade-off between the guarantee ratio and the reliability of fault-tolerance, and obviously outperforms other related methods.
منابع مشابه
An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملMultiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملData-aware task scheduling on heterogeneous hybrid memory multiprocessor systems
In this paper, we propose a method about task scheduling and data assignment on heterogeneous hybrid memory multiprocessor systems for real-time applications. In a heterogeneous hybrid memory multiprocessor system, an important problem is how to schedule real-time application tasks to processors and assign data to hybrid memories. The hybrid memory consists of dynamic random access memory and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005